Lattice paths: vicious walkers and friendly walkers

نویسنده

  • Anthony J. Guttmann
چکیده

In an earlier paper [4] the problem of vicious random walkers on a d-dimensional directed lattice was considered. \Vicious walkers" describes the situation in which two or more walkers arriving at the same lattice site annihilate one another. Accordingly, the only allowed con gurations are those in which contacts are forbidden. Alternatively expressed as a static rather than dynamic problem, vicious walkers are mutually self-avoiding networks of directed lattice walks, that is directed lattice paths, which in turn model directed polymer networks. The problem of vicious walkers was introduced to the mathematical physics literature by Fisher [5] in 1984, who also discussed a number of physical applications. The general model is one of P random walkers on a d-dimensional lattice, who at regular time intervals simultaneously take one step with equal probability in the direction of one of the allowed lattice vectors. In the combinatorics literature, an equivalent problem for any planar graph was treated by Gessel and Viennot [7], though some of their results had been anticipated in other settings [16, 15]. In considering lattice path problems in which the Gessel-Viennot formulation does not apply, Viennot [23] suggested a model where the mutual avoidance constraint is relaxed to the extent that two paths may share a site, and may even stay together for just one step, but must then diverge { though they may subsequently touch. We now call this model \the 2-friendlywalk model" since the number of consecutive sites the walkers are allowed to share, here two, distinguishes this model from vicious walkers, which are not allowed to share any consecutive sites. It also distinguishes it from the so-called osculating walkers, which form directed lattice paths that can share one, but no more than one, consecutive sites. This naming convention also leads us to make further natural generalisations, given below. Interestingly, each of the vicious, osculating and 2-friendly-walk models can be formulated as lattice statistical mechanical vertex models, which are models of ferroelectric materials (see

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The height of watermelons with wall Extended

The model of vicious walkers was introduced by Fisher [4]. He gave a number of applications in physics, such as modelling wetting and melting processes. In general, the model of vicious walkers is concerned with p random walkers on a d-dimensional lattice. In the lock step model, at each time step all of the walkers move one step in any of the allowed directions, such that at no time any two ra...

متن کامل

Nonintersecting Lattice Paths on the Cylinder

Abstract. We show how a formula concerning “vicious walkers” (which basically are nonintersecting lattice paths) on the cylinder given by P.J. Forrester can be proved and generalized by using the Lindström–Gessel–Viennot method, after having things set up in the right way. We apply the corresponding results to the (thermodynamic limit of the) free energy of the “lock step model of vicious walke...

متن کامل

Random Walks and Random Permutations

A connection is made between the random turns model of vicious walkers and random permutations indexed by their increasing subsequences. Consequently the scaled distribution of the maximum displacements in a particular asymmeteric version of the model can be determined to be the same as the scaled distribution of the eigenvalues at the soft edge of the GUE. The scaling of the distribution gives...

متن کامل

Vicious Walkers, Friendly Walkers and Young Tableaux Ii: with a Wall

We derive new results for the number of star and watermelon configurations of vicious walkers in the presence of an impenetrable wall by showing that these follow from standard results in the theory of Young tableaux, and combinatorial descriptions of symmetric functions. For the problem of n-friendly walkers, we derive exact asymptotics for the number of stars and watermelons both in the absen...

متن کامل

Generating function rationality for anisotropic vicious walk configurations on the directed square lattice

Guttmann and Vöge introduced a model of f -friendly walkers and argued that a generating function for the number of n-walker configurations making a total of k left steps is a rational function with denominator (1 − x). They also found that for f = 0, 1 and 2 the sums of the numerator coefficients for watermelon configurations in which each of 3 walkers made w left steps were 3-dimensional Cata...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999